On the Complexity of Scheduling with Communication Delay and Contention
نویسندگان
چکیده
We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.
منابع مشابه
Delay-Scheduled Controllers for Inter-Area Oscillations Considering Time Delays
Unlike the existing views that was introduced the existence of delay caused by the transmission of wide area measurement system data (WAMS) into the controllers input of the power oscilation damping (POD) by communication networks as a reason for poor performance of the POD controllers. This paper shows that the presence of time delay in the feedback loop may improve the performance of a POD co...
متن کاملCommunication Scheduling in Parallel Task Executions on Large Parallel Systems
Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns tasks in a direct acyclic graph (DAG) to processors. Usually only the allocation and ordering of tasks are considered, and sometimes communication time is included in the determination of priorities of the tasks, however, communication messages are not explicitly scheduled. Moreover, communication ...
متن کاملTrucks Scheduling to Reduce Delays in Multiple Cross-Docks Using Imperialist Competitive Algorithm
Cross docking is a logistics strategy that is now used by a large number of firms in the various industries. Cross docking effectively a significant reduction in transport costs, without increasing inventory and at the same time maintain the level of service to customers. It also can cross dock order to reduce cycle time, improve flexibility and responsiveness lead distribution network. In this...
متن کاملCommunication-aware Fault-tolerant Scheduling Strategy for Precedence Constrained Tasks in Heterogeneous Distributed Systems
Abstract Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. Primary-backup approach is a common methodology used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. For independent tasks, the backup copy can overload with other backup copies on the same pr...
متن کاملAn Effective Bi-Criteria and Contention Awareness Scheduling in Heterogeneous Distributed Systems
Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. In this paper we propose a fault-tolerant scheduling heuristics for precedence task that is based on primary-backup replication scheme on a realistic platform model where communication contention is taken into account. We focus on a bi-criteria approach, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 5 شماره
صفحات -
تاریخ انتشار 1995